A lower bound for the strong arithmetic regularity lemma

Abstract: The strong regularity lemma is a combinatorial tool originally introduced by Alon, Fischer, Krivelevich, and Szegedy in order to prove an induced removal lemma for graphs. Conlon and Fox showed that for some graphs, the strong regularity lemma must produce partitions of wowzer-type size. This talk will sketch a proof that a comparable lower bound must hold for the arithmetic analogue of this lemma, in the setting of vector spaces over finite fields.

combinatoricsgroup theory

Audience: researchers in the topic

Combinatorial and additive number theory (CANT 2025)